Minlos' lemma and Umemura's lemma

A simple proof of Zariski's Lemma

‎Our aim in this very short note is to show that the proof of the‎ ‎following well-known fundamental lemma of Zariski follows from an‎ ‎argument similar to the proof of the fact that the rational field‎ ‎$mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.

Generalizations of Borel-Cantelli Lemma

The Borel-Cantelli Lemma is very important in the probability theory‎. ‎In this paper‎, ‎we first describe the general case of the Borel-Cantelli Lemma‎. ‎The first part of this lemma‎, ‎assuming convergence and the second part includes divergence and independence assumptions‎. ‎In the following‎, ‎we have brought generalizations of the first and second part of this lemma‎. ‎In most generalizat...

Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory

Let D(n)(D(n, k)) denote the maximum possible d such that there exists a d-regular hypergraph (d-regular k-uniform hypergraph, respectively) on n vertices containing no proper regular spanning subhypergraph. The problem of estimating D(n) arises in Game Theory and Huckemann and Jurkat were the first to prove that it is finite. Here we give two new simple proofs that D(n), D(n, k) are finite, an...

Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars

The pumping lemma and Ogden lemma offer a powerful method to prove that a particular language is not context-free. In 2008 Kanazawa proved an analogue of pumping lemma for well-nested multiplecontext free languages. However, the statement of lemma is too weak for practical usage. We prove a stronger variant of pumping lemma and an analogue of Ogden lemma for the class of tree-adjoining language...

Lecture 19 : The Vanishing Lemma and Lemma 8 . 8